On strings of consecutive economical numbers of arbitrary length
نویسندگان
چکیده
In 1995, Bernardo Recamán Santos [4] defined a number n to be equidigital if the prime factorization of n requires the same number of decimal digits as n, and economical if its prime factorization requires no more digits. He asked whether there are arbitrarily long sequences of consecutive economical numbers. In 1998, Richard Pinch [2] gave an affirmative answer to this question assuming the prime k-tuple conjecture stated by L.E.Dickson [1] in 1904. He also exhibited one such sequence of length nine starting with the 19-digit number 1034429177995381247 and conjectured that such a sequence of arbitrary length always exists.
منابع مشابه
Economical Numbers
A number n is said to be economical if the prime power factori-sation of n can be written with no more digits than n itself. We show that under a plausible hypothesis, related to the twin prime conjecture, there are arbitrarily long sequences of consecutive economial numbers, and exhibit such a sequence of length 9.
متن کاملSmallest examples of strings of consecutive happy numbers
A happy number N is defined by the condition S(N ) = 1 for some number n of iterations of the function S, where S(N ) is the sum of the squares of the digits of N . Up to 10, the longest known string of consecutive happy numbers was length five. We find the smallest string of consecutive happy numbers of length 6, 7, 8, . . . , 13. For instance, the smallest string of six consecutive happy numb...
متن کاملSelf-Replicating Sequences of Binary Numbers: The Build-Up of Complexity
A recently introduced system of self-replicating sequences of binary numbers (strings) is generalized. It is extended to include st rings of arbitrary length . For this purpose, first , the folding methods of st rings into two-dimensional operat ors are expanded to include strings of arbitr ary size. Second, rules of interact ion between str ings of different lengths are established. As a natur...
متن کاملFast Generation of Fibonacci Permutations
In 1985, Simion and Schmidt showed that |Sn(τ3)|, the cardinality of the set of all length n permutations avoiding the patterns τ3 = {123, 213, 132} is the Fibonacci numbers, fn+1. They also developed a constructive bijection between the set of all binary strings with no two consecutive ones and Sn(τ3). In May 2004, Egge and Mansour generalized this SimionSchmidt counting result and showed that...
متن کاملFNR: Arbitrary Length Small Domain Block Cipher Proposal
We propose a practical flexible (or arbitrary) length small domain block cipher, FNR encryption scheme. FNR denotes Flexible Naor and Reingold. It can cipher small domain data formats like IPv4, Port numbers, MAC Addresses, Credit card numbers, any random short strings while preserving their input length. In addition to the classic Feistel networks, Naor and Reingold propose usage of Pair-wise ...
متن کامل